Resource Allocation with Carrier Aggregation in Cellular Networks by Haya Shajaiah Ahmed Abdelhadi & Charles Clancy

Author:Haya Shajaiah, Ahmed Abdelhadi & Charles Clancy
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

(4.15)

where , C i j = 0 and M j VIP is the number of users in . After the eNodeB performs the RA process for the jth carrier by solving optimization problem (4.15), each VIP user in is allocated a rate that is equivalent to r i j, all by carrier j whereas users in are not allocated any of the jth carrier resources. The total rate allocated by the eNodeB to each user is equivalent to C i + r i j, all. In optimization problem (4.15), we consider a utility proportional fairness objective function, based on carrier aggregation, that the eNodeB seeks to maximize when it performs RA for carrier j.

Case 3. RA Optimization Problem When C i < r i req for Any User and Where q i j = 0 if C i ≥ r i req and q i j = r i req − C i if C i < r i req

The eNodeB selects the optimization problem of this case to allocate the jth carrier resources if the total aggregated rate C i for any user i is less than the user’s application minimum required rate r i req and the summation for VIP users in is less than the carrier’s available resources R j . In this case, the eNodeB allocates the jth carrier resources to all UEs in . The RA optimization problem for the jth carrier in this case is given by:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.